SQP methods for large - scalenonlinear programmingby
نویسنده
چکیده
We compare and contrast a number of recent sequential quadratic programming (SQP) methods that have been proposed for the solution of large-scale nonlinear programming problems. Both line-search and trust-region approaches are considered, as are the implications of interior-point and quadratic programming methods.
منابع مشابه
On the Performance of SQP Methods for Nonlinear Optimization
This paper concerns some practical issues associated with the formulation of sequential quadratic programming (SQP) methods for large-scale nonlinear optimization. SQP methods find an approximate solution of a sequence of quadratic programming (QP) subproblems in which a quadratic model of the objective function is minimized subject to the linearized constraints. Extensive numerical results are...
متن کاملInterior point SQP strategies for large-scale, structured process optimization problems
Successive Quadratic Programming (SQP) has been the method of choice for the solution of many nonlinear programming problems in process engineering. However, for the solution of large problems with SQP based codes, the combinatorial complexity associated with active set quadratic programming (QP) methods can be a bottleneck in exploiting the problem structure. In this paper, we examine the meri...
متن کاملSqp Methods for Large-scale Nonlinear Programming Presented at the 19th Ifip Tc7 Conference on System Modelling and Optimization, Sqp Methods for Large-scale Nonlinear Programming
We compare and contrast a number of recent sequential quadratic programming (SQP) methods that have been proposed for the solution of large-scale nonlinear programming problems. Both line-search and trust-region approaches are considered, as are the implications of interior-point and quadratic programming methods. 1 Presented at the 19th IFIP TC7 Conference on System Modelling and Optimization,...
متن کاملSequential Quadratic Programming �
Introduction Since its popularization in the late s Sequential Quadratic Program ming SQP has arguably become the most successful method for solving nonlinearly constrained optimization problems As with most optimization methods SQP is not a single algorithm but rather a conceptual method from which numerous speci c algorithms have evolved Backed by a solid theoretical and computational foundat...
متن کاملMethods for Nonlinear Constraints in Optimization Calculations
Ten years ago, the broad consensus among researchers in constrained optimization was that sequential quadratic programming (SQP) methods were the methods of choice. While, in the long term, this position may be justiied, the past ten years have exposed a number of diiculties with the SQP approach. Moreover, alternative methods have shown themselves capable of solving large-scale problems. In th...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 1999